Cutting convex curves
نویسندگان
چکیده
We show that for any two convex curves C1 and C2 in Rd parametrized by [0, 1] with opposite orientations, there exists a hyperplane H with the following property: For any t ∈ [0, 1] the points C1(t) and C2(t) are never in the same open halfspace bounded by H. This will be deduced from a more general result on equipartitions of ordered point sets by hyperplanes.
منابع مشابه
Development of Curves on Polyhedra via Conical Existence
We establish that certain classes of simple, closed, polygonal curves on the surface of a convex polyhedron develop in the plane without overlap. Our primary proof technique shows that such curves “live on a cone,” and then develops the curves by cutting the cone along a “generator” and flattening the cone in the plane. The conical existence results support a type of source unfolding of the sur...
متن کاملSource Unfoldings of Convex Polyhedra via Certain Closed Curves
We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q “lives on a cone” to both sides; it includes simple, closed quasigeodesics. Cutting a particular subset of the cut locus of Q (in P) leads to a non-overlapping unfolding of the polyhedron. This gives a new gen...
متن کاملL2GSCI: Local to Global Seam Cutting and Integrating for Accurate Face Contour Extraction
Current face alignment algorithms can robustly find a set of landmarks along face contour. However, the landmarks are sparse and lack curve details, especially in chin and cheek areas where a lot of concave-convex bending information exists. In this paper, we propose a local to global seam cutting and integrating algorithm (L2GSCI) to extract continuous and accurate face contour. Our method wor...
متن کاملTowards a Practical Volumetric Cutting Plane Method for Convex Programming
We consider the volumetric cutting plane method for nding a point in a convex set C < n that is characterized by a separation oracle. We prove polynomiality of the algorithm with each added cut placed directly through the current point, and show that this \central cut" version of the method can be implemented using no more than 25n constraints at any time. with support from a CORE fellowship.
متن کاملCutting plane oracles to minimize non-smooth non-convex functions
We discuss a bundle method for non-smooth non-convex optimization programs. In the absence of convexity, a substitute for the cutting plane mechanism has to be found. We propose such a mechanism and prove convergence of our method in the sense that every accumulation point of the sequence of serious iterates is critical.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 58 شماره
صفحات -
تاریخ انتشار 2016